Structuring Retrenchments in B by Decomposition
نویسندگان
چکیده
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalization of classical refinement, for the formal description of application developments too demanding for refinement. This work initiates the study of the structuring of retrenchment-based developments in B by decomposition. A given coarse-grained retrenchment relation between specifications is decomposed into a family of more fine-grained retrenchments. The resulting family may distinguish more incisively between refining, approximately refining, and non-refining behaviours. Two decomposition results are given, each sharpening a coarsegrained retrenchment within a particular syntactic structure for operations at concrete and abstract levels. A third result decomposes a retrenchment exploiting structure latent in both levels. The theory is illustrated by a simple example based on an abstract model of distributed computing, and methodological aspects are considered.
منابع مشابه
Structuring Retrenchments in the small with B
Simple retrenchment is briefly reviewed as a liberalisation of classical refinement, for the formal description of application developments too demanding for refinement. Two generalisations, output and evolving retrenchment, are presented. Simple monotonicity results for retrenchment are recalled, forming the basis of a piecewise development method. This work then commences the study of the str...
متن کاملStronger compositions for retrenchments
Noting that the usual ‘propositionally’ based way of composing retrenchments can yield many ‘junk’ cases, alternative approaches to composition are introduced (via notions of tidy, neat, and fastidious retrenchments) that behave better in this regard. These alternatives do however make other issues such as associativity harder. The technical details are presented for vertical composition of ret...
متن کاملMorphological Structuring Elements
For image processing systems that have a limited size of region of support, say 3 x 3, direct implementation of morphological operations by a structuring element larger than the prefixed size is impossible. The decomposition of morphological operations by a large structuring element into a sequence of recursive operations, each using a smaller structuring element, enables the implementation of ...
متن کاملBi-Gyrogroup: The Group-Like Structure Induced by Bi-Decomposition of Groups
The decomposition $Gamma=BH$ of a group $Gamma$ into a subset B and a subgroup $H$ of $Gamma$ induces, under general conditions, a group-like structure for B, known as a gyrogroup. The famous concrete realization of a gyrogroup, which motivated the emergence of gyrogroups into the mainstream, is the space of all relativistically admissible velocities along with a binary mbox{...
متن کاملRetrenchment and Promotion in Z
Promotion, a familiar data structuring mechanism in Z, is reviewed. Retrenchment, a generalization of classical data refinement, is reviewed and presented in Z. A theory of the promotion of retrenchments in Z is developed, which supports a variety of requirements scenarios and demonstrates that promotion is also a useful tool in the requirements engineering toolkit of retrenchment. This amplifi...
متن کامل